Combinatorial Aspects of Connes’s Embedding Conjecture and Asymptotic Distribution of Traces of Products of Unitaries
نویسنده
چکیده
In this paper we study the asymptotic distribution of the moments of (nonnormalized) traces Tr(w1),Tr(w2), . . . ,Tr(wr), where w1, w2, . . . , wr are reduced words in unitaries in the group U(N). We prove that as N → ∞ these variables are distributed as normal gaussian variables √ j1Z1, . . . , √ Zr , where j1, . . . , jr are the number of cyclic rotations of the words w1, . . . , ws leaving them invariant. This extends a previous result by Diaconis ([4]), where this it was proved, that Tr(U),Tr(U), . . . , Tr(U) are asymptotically distributed as Z1, √ 2Z2, . . . , √ pZp. We establish a combinatorial formula for ∫ |Tr(w1)| · · · |Tr(wp)|. In our computation we reprove some results from [1].
منابع مشابه
Asymptotic behaviour of associated primes of monomial ideals with combinatorial applications
Let $R$ be a commutative Noetherian ring and $I$ be an ideal of $R$. We say that $I$ satisfies the persistence property if $mathrm{Ass}_R(R/I^k)subseteq mathrm{Ass}_R(R/I^{k+1})$ for all positive integers $kgeq 1$, which $mathrm{Ass}_R(R/I)$ denotes the set of associated prime ideals of $I$. In this paper, we introduce a class of square-free monomial ideals in the polynomial ring $R=K[x_1,ld...
متن کاملWiener Way to Dimensionality
This note introduces a new general conjecture correlating the dimensionality dT of an infinite lattice with N nodes to the asymptotic value of its Wiener Index W(N). In the limit of large N the general asymptotic behavior W(N)≈Ns is proposed, where the exponent s and dT are related by the conjectured formula s=2+1/dT allowing a new definition of dimensionality dW=(s-2)-1. Being related to the t...
متن کاملOptimizing the Distribution of Dairy Products by Heuristic Algorithms and Geographic Information System: A Case Study of FARS PEGAH DAIRY COMPANY
The problem of the distribution of dairy products, which is classified as a combinatorial optimization problem, cannot be solved in polynomial time. In this paper, an algorithm based on Ant Colony Hybrid meta-heuristic system and Geographic Information System (GIS) was used to find a near-optimal solution to this problem. Using the former method, the nearest neighbor heuristic algorithm was use...
متن کاملSome combinatorial aspects of finite Hamiltonian groups
In this paper we provide explicit formulas for the number of elements/subgroups/cyclic subgroups of a given order and for the total number of subgroups/cyclic subgroups in a finite Hamiltonian group. The coverings with three proper subgroups and the principal series of such a group are also counted. Finally, we give a complete description of the lattice of characteristic subgroups of a finite H...
متن کاملLinear Sphericity Testing of 3-Connected Single Source Digraphs
It has been proved that sphericity testing for digraphs is an NP-complete problem. Here, we investigate sphericity of 3-connected single source digraphs. We provide a new combinatorial characterization of sphericity and give a linear time algorithm for sphericity testing. Our algorithm tests whether a 3-connected single source digraph with $n$ vertices is spherical in $O(n)$ time.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2006